Probabilistic Simplex Component Analysis

نویسندگان

چکیده

This study presents PRISM, a probabilistic simplex component analysis approach to identifying the vertices of data-circumscribing from data. The problem has rich variety applications, most notable being hyperspectral unmixing in remote sensing and non-negative matrix factorization machine learning. PRISM uses simple model, namely, uniform data distribution additive Gaussian noise, it carries out inference by maximum likelihood. model is sound sense that are provably identifiable under some assumptions, suggests can be effective combating noise when number points large. strong, but hidden, relationships with volume minimization, powerful geometric for same problem. We these fundamental aspects, we also consider algorithmic schemes based on importance sampling variational inference. In particular, scheme shown resemble special regularizer, which draws an interesting connection approach. Numerical results provided demonstrate potential PRISM.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Probabilistic Principal Component Analysis

Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive o...

متن کامل

Sparse Probabilistic Principal Component Analysis

Principal component analysis (PCA) is a popular dimensionality reduction algorithm. However, it is not easy to interpret which of the original features are important based on the principal components. Recent methods improve interpretability by sparsifying PCA through adding an L1 regularizer. In this paper, we introduce a probabilistic formulation for sparse PCA. By presenting sparse PCA as a p...

متن کامل

A Unified Framework for Probabilistic Component Analysis

We present a unifying framework which reduces the construction of probabilistic component analysis techniques to a mere selection of the latent neighbourhood, thus providing an elegant and principled framework for creating novel component analysis models as well as constructing probabilistic equivalents of deterministic component analysis methods. Under our framework, we unify many very popular...

متن کامل

Compositional Reliability Analysis using Probabilistic Component Automata

Compositionality is a key property in the development and analysis of component-based systems. In non-probabilistic formalisms such as Labelled Transition Systems (LTS) the functional behaviour of a system can be readily constructed from the behaviours of its parts. However, this is not true for probabilistic extensions of LTS, which are necessary to analyse non-functional properties such as re...

متن کامل

Shift-Invariant Probabilistic Latent Component Analysis

In this paper we present a model which can decompose a probability densities or count data into a set of shift invariant components. We begin by introducing a regular latent variable model and subsequently extend it to deal with shift invariance in order to model more complex inputs. We develop an expectation maximization algorithm for estimating components and present various results on challe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Signal Processing

سال: 2022

ISSN: ['1053-587X', '1941-0476']

DOI: https://doi.org/10.1109/tsp.2021.3133690